Energy-Aware Scheduling in Hybrid Flow Shop Using Firefly Algorithm
نویسندگان
چکیده
منابع مشابه
Genetic Algorithm Based Optimization for Energy-aware Hybrid Flow Shop Scheduling
Based on MATLAB/SimEvents simulation platform and genetic algorithm, the simulation and optimization of energy consumption in hybrid flow shop is studied. Considering workshop layout and workpiece path, machining process simulation in hybrid flow shop is realized. With the processing time, processing power and stand-by power introduced into simulation model, the energy consumption simulation in...
متن کاملSolving hybrid flow shop scheduling problems using bat algorithm
This paper investigates the multistage hybrid flow shop (HFS) scheduling problems using the new bat algorithm. A HFS is the generalisation of flowshop with multiple machines. HFS is one of the important scheduling problems that represent many industries like iron and steel, chemical, textile and ceramic industries. The HFS scheduling problems have been proved to be NP-hard. A recently developed...
متن کاملA Hybrid Algorithm Using Firefly and Cuckoo Search Algorithm for Flexible Open Shop Scheduling Problem
In this paper presents the hybrid algorithm using firefly and a cuckoo search algorithm for flexible open shop scheduling problem. The flexible, open shop scheduling is known to be NP-hard. Cuckoo algorithm (CA) is one of the widely used techniques for constrained optimization. And it gave the best results compared to other algorithms. A disadvantage of cuckoo algorithm though is that they easi...
متن کاملA Novel Hybrid Algorithm for Permutation Flow Shop Scheduling
In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...
متن کاملA Hybrid Genetic Algorithm for the Flow-Shop Scheduling Problem
This paper presents a hybrid genetic algorithm for the Job Shop Scheduling problem. The chromosome representation of the problem is based on random keys. The schedules are constructed using a priority rule in which the priorities are defined by the genetic algorithm. Schedules are constructed using a procedure that generates parameterized active schedules. After a schedule is obtained a local s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Jurnal Teknik Industri
سال: 2021
ISSN: 2527-4112,1978-1431
DOI: 10.22219/jtiumm.vol22.no1.18-30